LMHS: A SAT-IP Hybrid MaxSAT Solver
نویسندگان
چکیده
We describe LMHS, an open source weighted partial maximum satisfiability (MaxSAT) solver. LMHS is a hybrid SAT-IP MaxSAT solver that implements the implicit hitting set approach to MaxSAT. On top of the main algorithm, LMHS offers integrated preprocessing, solution enumeration, an incremental API, and the use of a choice of SAT and IP solvers. We describe the main features of LMHS, and give empirical results on the influence of preprocessing and the choice of the underlying SAT and IP solvers on the performance of LMHS.
منابع مشابه
Solving MAXSAT by Decoupling Optimization and Satisfaction
Solving MAXSAT by Decoupling Optimization and Satisfaction Jessica Davies Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2013 Many problems that arise in the real world are di cult to solve partly because they present computational challenges. Many of these challenging problems are optimization problems. In the real world we are generally interested not just ...
متن کاملExploiting the Power of mip Solvers in maxsat
maxsat is an optimization version of satisfiability. Since many practical problems involve optimization, there are a wide range of potential applications for effective maxsat solvers. In this paper we present an extensive empirical evaluation of a number of maxsat solvers. In addition to traditional maxsat solvers, we also evaluate the use of a state-of-the-art Mixed Integer Program (mip) solve...
متن کاملOpen-WBO: A Modular MaxSAT Solver,
This paper presents OPEN-WBO, a new MaxSAT solver. OPEN-WBO has two main features. First, it is an open-source solver that can be easily modified and extended. Most MaxSAT solvers are not available in open-source, making it hard to extend and improve current MaxSAT algorithms. Second, OPENWBO may use any MiniSAT-like solver as the underlying SAT solver. As many other MaxSAT solvers, OPEN-WBO re...
متن کاملPostponing Optimization to Speed Up MAXSAT Solving
maxsat is an optimization version of sat that can represent a wide variety of important optimization problems. A recent approach for solving maxsat is to exploit both a sat solver and a Mixed Integer Programming (mip) solver in a hybrid approach. Each solver generates information used by the other solver in a series of iterations that terminates when an optimal solution is found. Empirical resu...
متن کاملSAT-based Preprocessing for MaxSAT (extended version)
State-of-the-art algorithms for industrial instances of MaxSAT problem rely on iterative calls to a SAT solver. Preprocessing is crucial for the acceleration of SAT solving, and the key preprocessing techniques rely on the application of resolution and subsumption elimination. Additionally, satisfiability-preserving clause elimination procedures are often used. Since MaxSAT computation typicall...
متن کامل